LEAST COST PATH ALGORITHM DESIGN FOR HIGHWAY ROUTE SELECTION

BIG BANG – BIG CRUNCH ALGORITHM FOR LEAST-COST DESIGN OF WATER DISTRIBUTION SYSTEMS

The Big Bang-Big Crunch (BB–BC) method is a relatively new meta-heuristic algorithm which inspired by one of the theories of the evolution of universe. In the BB–BC optimization algorithm, firstly random points are produced in the Big Bang phase then these points are shrunk to a single representative point via a center of mass or minimal cost approach in the Big Crunch phase. In this paper, the...

Multiple-Path Selection for new Highway Alignments using Discrete Algorithms

This paper addresses the problem of finding multiple near-optimal, spatially-dissimilar paths that can be considered as alternatives in the decision making process, for finding optimal corridors in which to construct a new road. We further consider combinations of techniques for reducing the costs associated with the computation and increasing the accuracy of the cost formulation. Numerical res...

Optimizing Cost Function in Imperialist Competitive Algorithm for Path Coverage Problem in Software Testing

Search-based optimization methods have been used for software engineering activities such as software testing. In the field of software testing, search-based test data generation refers to application of meta-heuristic optimization methods to generate test data that cover the code space of a program. Automatic test data generation that can cover all the paths of software is known as a major cha...

AMIS: Least Cost Path Analysis for Transportation Planning

A selection function based distributed algorithm for delay-constraint least-cost unicast routing

each network node and is always able to find a loop-free path satisfying the delay bound if such paths exist. Simulation study shows that the SF-DCLC is not as sensitive to the delay bound and network size as some other DCLC routing algorithms, and attains very low cost-inefficiency (less than 3% to the optimal one) in various network scenarios we simulate. The most attractive feature of SF-DCL...